A Collection of 2D Elliptic Problems for Testing Adaptive Algorithms
نویسنده
چکیده
Adaptive grid refinement is a critical component of the improvements that have recently been made in algorithms for the numerical solution of partial differential equations (PDEs). The development of new algorithms and computer codes for the solution of PDEs usually involves the use of proof-of-concept test problems. 2D elliptic problems are often used as the first test bed for new algorithms and codes. This paper contains a set of twelve parametrized 2D elliptic test problems for adaptive grid refinement algorithms and codes. The problems exhibit a variety of types of singularities, near singularities, and other difficulties.
منابع مشابه
A collection of 2D elliptic problems for testing adaptive grid refinement algorithms
Adaptive grid refinement is a critical component of the improvements that have recently been made in algorithms for the numerical solution of partial differential equations (PDEs). The development of new algorithms and computer codes for the solution of PDEs usually involves the use of proof-of-concept test problems. 2D elliptic problems are often used as the first test bed for new algorithms a...
متن کاملDeveloping Self-adaptive Melody Search Algorithm for Optimal Operation of Multi-reservoir Systems
Operation of multi-reservoir systems is known as complicated and often large-scale optimization problems. The problems, because of broad search space, nonlinear relationships, correlation of several variables, as well as problem uncertainty, are difficult requiring powerful algorithms with specific capabilities to be solved. In the present study a Self-adaptive version of Melody Search algorith...
متن کاملAn Adaptive Approach to Increase Accuracy of Forward Algorithm for Solving Evaluation Problems on Unstable Statistical Data Set
Nowadays, Hidden Markov models are extensively utilized for modeling stochastic processes. These models help researchers establish and implement the desired theoretical foundations using Markov algorithms such as Forward one. however, Using Stability hypothesis and the mean statistic for determining the values of Markov functions on unstable statistical data set has led to a significant reducti...
متن کاملTesting Soccer League Competition Algorithm in Comparison with Ten Popular Meta-heuristic Algorithms for Sizing Optimization of Truss Structures
Recently, many meta-heuristic algorithms are proposed for optimization of various problems. Some of them originally are presented for continuous optimization problems and some others are just applicable for discrete ones. In the literature, sizing optimization of truss structures is one of the discrete optimization problems which is solved by many meta-heuristic algorithms. In this paper, in or...
متن کاملA Local Strong form Meshless Method for Solving 2D time-Dependent Schrödinger Equations
This paper deals with the numerical solutions of the 2D time dependent Schr¨odinger equations by using a local strong form meshless method. The time variable is discretized by a finite difference scheme. Then, in the resultant elliptic type PDEs, special variable is discretized with a local radial basis function (RBF) methods for which the PDE operator is also imposed in the local matrices. Des...
متن کامل